A search game on a cyclic graph

There is a finite cyclic graph. The hider chooses one of all nodes except the specified one, and he hides an (immobile) object there. At the beginning the seeker is at the specified node. After the seeker chooses an ordering of the nodes except the specified one, he examines each nodes in that order until he finds the object, traveling along edges. It costs an amount when he moves from a node to an adjacent one and also when he checks a node. While the hider wishes to maximize the sum of the traveling costs and the examination costs which are required to find the object, the seeker wishes to minimize it. The problem is modeled as a two‐person zero‐sum game. We solve the game when unit costs (traveling cost + examination cost) have geometrical relations depending on nodes. Then we give properties of optimal strategies of both players. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Optimal pricing for a short life‐cycle product when customer price‐sensitivity varies over time

Technology products often experience a life‐cycle demand pattern that resembles a diffusion process, with weak demand in the beginning and the end of the life cycle and high demand intensity in between. The customer price‐sensitivity also changes over the life cycle of the product. We study the prespecified pricing decision for a product that exhibits such demand characteristics. In particular, we determine the optimal set of discrete prices and the times to switch from one price to another, when a limited number of price changes are allowed. Our study shows that the optimal prices and switching times show interesting patterns that depend on the product's demand pattern and the change in the customers' price sensitivity over the life cycle of the product. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

The Chinese and Asian impact on Russian nuclear policy

Asia, where nuclear powers already interact (including North Korea), exerts a growing influence on the thinking and policy underlying Russia's current and future nuclear (and overall defense) posture. China's rise is forcing Russia into a greater reliance on strategic offensive weapons and tactical nuclear weapons. These in turn will reinforce its opposition to US missile defenses, not only in Europe but also in Asia. Russia must now entertain the possibility of nuclear use in regional conflicts that would otherwise remain purely conventional. It cannot be postulated blindly that nuclear weapons serve no discernible purpose other than to deter nuclear attacks by other nuclear powers. The strategic equation in Asia and in the Russian Far East convincingly demonstrates the falsity of this approach. Nuclear weapons will be the essential component of Russia's regional defense policy if not of its overall policies – and this also includes contingencies in Europe.     

基于变异离散粒子群的协同空战攻击决策算法

为了提高智能协同空战攻击决策算法性能,将变异策略引入到DPSO(Discrete Particle Swarm Optimization)协同空战攻击决策算法中,提出了一种新的基于变异离散粒子群(Mutation Discrete Particle Swarm Optimization,MDPSO)的协同空战攻击决策算法。基于典型空战想定背景,仿真验证了算法的有效性。采用对比实验方法,基于准确性、可靠性和快速性等关键性能指标,分析比较了基于MDPSO协同空战攻击决策算法与多种智能决策算法,验证了基于MDPSO的协同空战攻击决策算法有着较好的综合性能。     

水下潜器自导搜索策略仿真平台设计与应用

根据研究实际需求,本文基于作战能力评估理论对水下潜器自导搜索策略仿真平台进行了开发设计,并结合建立的多指标评估体系和相应的评估方法,借助均匀设计法,将其成功应用于水下潜器自导搜索策略的设计优化中。文中首先分析了仿真平台的系统需求,进而确定了其总体构架,并针对自导搜索策略研究的特点确定了相应的人机交互界面。最后给出了进行自导搜索策略仿真优化的基本思路和方法,并通过水下潜器最优自导搜索策略方案仿真研究的实例表明,本文设计的仿真平台和研究方法不仅完全能够满足水下潜器的自导搜索策略仿真研究需求,还能有效节省科研成本,具有重要的工程应用价值。     

军民融合背景下军工企业多元化发展战略研究

冷战结束后,欧美多数军工企业在军转民的过程中采取多元化的经营战略,壮大企业规模并寻求进一步的发展。随着我国军民融合战略的深入实施,军工企业不再是封闭独立的单一军品生产基地,而是顺时应势逐步实现军品和民品同步多元化发展的战略转型。通过分析我国军工企业军转民的历史进程与国际经验,结合多元化战略的特点,考察军工企业在军转民过程中实施多元化战略的动因,构建军工企业多元化战略的选择函数。本文认为,军工企业选择多元化战略应考虑企业自身实际情况,积极响应国家政策,培育核心竞争力;同时,军转民过程作为军民融合深度发展的重要一环,会促使军工企业往多元化的方向发展,而多元化战略的实施也会加快军民融合深度发展的进程。     

基于DXC的军事传送网恢复策略研究

可靠性对于军事传送网而言显得尤为重要。数字交叉连接(DXC)设备提供了一个灵活的冗余和保护以满足用户的需求,有利于最小化服务中断时间。文中首先介绍了DXC设备及其应用;其次,讨论了基于DXC设备的恢复应该考虑的问题;最后,结合军事传送网的特点,提出了恢复策略,并对此进行了讨论。     

随舰备件需求分析中维修策略问题

分析了面向任务保障性工程理论指导下的舰船随舰备件配置问题,就最大、最小两种维修策略下随舰备件配置问题进行了研究,给出了面向任务的随舰备件需求分析仿真模型框架,结合算倒,研究了最大维修策略与最小维修策略的适用时机:在任务确定且任务结构函数明确条件下,应采用最小维修策略;否则采用最大维修策略.     

The practice of strategy: South African defence in stasis

The article concerns the strategy development processes of the South African Department of Defence in South Africa. It intends to identify the probable causes of the observed failure of the South African National Defence Force to develop appropriate departmental policy and military strategy. Military strategy comprises force development, force employment, force deployment and the coordination of these elements in pursuit of national, grand-strategic objectives. (See Dennis M. Drew and Donald M. Snow, Making Twenty-first Century Strategy: An Introduction to Modern National Security Processes and Problems Montgomery, AL: Air University Press, Maxwell Air Force Base, November 2006, 103). Of these four constructs, the article concerns itself only with the first two. The article analyses two complementary approaches to strategy formation: a resource-driven, inside-out model and an interests-driven, outside-in method. The article concludes that the Department is preoccupied with the inside-out method to the lasting detriment of the declared strategic intent of the defence policy.     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.